EXPLICIT PLANNING FOR PARAGRAPH WRITING CLASS
نویسندگان
چکیده
منابع مشابه
Ogg's Theorem via Explicit Congruences for Class Equations Ogg's Theorem via Explicit Congruences for Class Equations *
Explicit congruences (mod p) are proved for the class equations or the products of class equations corresponding to discriminants D = −8p,−3p, −12p in the theory of complex multiplication, where p is an odd prime. These congruences are used to give a new proof of a theorem of Ogg, which states that there are exactly 15 primes p for which all j-invariants of supersingular elliptic curves in char...
متن کاملA Methodology for Writing Class Contracts
One of the principles of Design by Contract is that contracts for software components must be written in a declarative way, using a formal, mathematically founded notation. When we apply the Design by Contract methodology in a naive and straightforward way, we risk ending up with unwanted duplication. In this paper, we describe a methodology for writing class contracts that avoids specification...
متن کاملPlanning for Grid Applications with Explicit Reservations
Computation and data intensive grid applications are often composed of independent components distributed over a wide-area network. Such components usually interact by consuming and producing files, which are transferred between network hosts using protocols such as GridFTP. An application configuration is defined by the choice of components, data files, hosts, and data transfer sessions, and d...
متن کاملSemi-Explicit First-Class Polymorphism for ML
We propose a modest conservative extension to ML that allows semiexplicit first-class polymorphism while preserving the essential properties of type inference. In our proposal, the introduction of polymorphic types is fully explicit, that is, both introduction points and exact polymorphic types are to be specified. However, the elimination of polymorphic types is semiimplicit: only elimination ...
متن کاملSemi-Explicit First-Class Polymorphism for MLy
We propose a modest conservative extension to ML that allows semi-explicit rst-class poly-morphism while preserving the essential properties of type inference. In our proposal, the introduction of polymorphic types is fully explicit, that is, both introduction points and exact polymorphic types are to be speciied. However, the elimination of polymorphic types is semi-implicit: only elimination ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jurnal Bahasa Lingua Scientia
سال: 2017
ISSN: 2549-4228,2086-1753
DOI: 10.21274/ls.2017.9.2.241-260